A bi-objective optimization framework for three-dimensional road alignment design

Optimization of three-dimensional road alignments is a nonlinear non-convex optimization problem. The development of models that fully optimize a three-dimensional road alignment problem is challenging due to numerous factors involved and complexities in the geometric specification of the alignment. In this study, we developed a novel bi-objective optimization approach to solve a three dimensional road alignment problem where the horizontal and vertical alignments are optimized simultaneously. Two conflicting cost objective functions, earthwork cost and the utility cost, are cast in a bi-objective optimization problem. We numerically compare several multi-objective optimization solvers, and find that it is possible to determine the Pareto front in a reasonable time.     

Multi-objective re-synchronizing of bus timetable: Model,complexity and solution

This work is originally motived by the re-planning of a bus network timetable. The existing timetable with even headways for the network is generated using line by line timetabling approach without considering the interactions between lines. Decision-makers (i.e., schedulers) intend to synchronize vehicle timetable of lines at transfer nodes to facilitate passenger transfers while being concerned with the impacts of re-designed timetable on the regularity of existing timetable and the accustomed trip plans of passengers. Regarding this situation, we investigate a multi-objective re-synchronizing of bus timetable (MSBT) problem, which is characterized by headway-sensitive passenger demand, uneven headways, service regularity, flexible synchronization and involvement of existing bus timetable. A multi-objective optimization model for the MSBT is proposed to make a trade-off between the total number of passengers benefited by smooth transfers and the maximal deviation from the departure times of the existing timetable. By clarifying the mathematical properties and solution space of the model, we prove that the MSBT problem is NP-hard, and its Pareto-optimal front is non-convex. Therefore, we design a non-dominated sorting genetic (NSGA-II) based algorithm to solve this problem. Numerical experiments show that the designed algorithm, compared with enumeration method, can generate high-quality Pareto solutions within reasonable times. We also find that the timetable allowing larger flexibility of headways can obtain more and better Pareto-optimal solutions, which can provide decision-makers more choice.     

基于PSO-BP神经网络的油船中部结构优化

以舱段质量为目标函数,以相关规范要求的板厚及应力为约束条件,通过灵敏度分析确定设计变量,对油船中部结构优化。构建基于粒子群优化的BP神经网络模型,并代替有限元分析确定应力与设计变量之间关系,从而对舱段进行结构优化。优化后舱段质量降低了4.2%,优化后的有限元分析结果表明满足规范要求,PSOBP神经网络模型在船舶结构优化设计中具有可行性。     

基于一个二维水弹塑性方法和极限强度评估的集装箱船结构优化研究

海上极端波过去常常导致船舶结构的极限破坏,而船舶的极限崩溃涉及到船体结构的动态极限强度和结构非线性.该文通过二维的水弹塑性方法研究了集装箱船在极端波中的非线性动态强度,该方法考虑了船体的极限强度以及船体结构的非线性和波浪之间的耦合.并通过该二维水弹塑性方法和极限评估方法研究了船体结构的结构优化.文中还通过二次规划法(SQP)来优化基于非线性的动态强度的集装箱船体结构.最少的结构成本是本优化的目标函数,约束条件保证船体的强度要小于结构的极限强度,并且结构设计尺寸要满足规范的要求.随着设计波高的变化,这些优化的设计变量的变化趋势得以发现,一些研究的结论可用于船舶规范的参考.     

基于48000载重吨教学实习船的动力学结构优化

本文以48000载重吨教学实习船为研究对象,采用通用有限元软件MSC.Patran/Nastran进行全船频响分析.全船有限元计算条件要求极高,而一般情况下又存在各种资料的限制或实验数据的缺失,因而会使得计算精度较低.本文介绍利用基本的设计资料的条件下,从模态参与系数角度结合模态振型提出一种新的动力学结构优化思路,并进行计算分析以验证该方法的可行性与准确性,为全船有限元振动分析提供新的研究思路.     

二维多翼升力的简化计算模型与布局优化

在势流框架内,针对多翼绕流相互干扰的动力学现象开展了研究.结合线性薄翼理论与四分之一四分之三点涡模型,建立了多翼升力的快速计算模型,能够简便高效地估算多翼系统的各个翼升力.基于此计算模型,分析了翼的个数和间距对多翼升力的影响,得到了使总升力达到最大的最优间距布置.     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

跨境供应链网络海外仓的鲁棒性选址模型及算法

新经济形态下，全球政治、经济形势瞬息万变，多种人为和自然因素导致商业供应链的生存环境日益严峻. 跨境供应链网络作为典型的时效性和运营环境等都具有极大不确定性的复杂网络，研究其鲁棒性问题具有一定的理论意义和实际应用场景. 首先阐明了跨境供应链网络的内涵，认为海外仓的选址优化是控制网络鲁棒性的重要手段；随后基于最小最大后悔值构建了海外仓的鲁棒性选址模型，利用情景松弛算法对模型进行求解. 算例分析结果证明，所构建的海外仓鲁棒性选址模型及算法适用于跨境供应链网络情景.     

智能网联车环境下高速匝道汇入车流轨迹优化模型

为了解决传统匝道控制车流汇入时车辆需要减速至停止，从而造成延误时间过长的问题，提出了一种智能网联车环境下的高速匝道汇入车辆轨迹优化的两阶段优化模型，其中，第1 阶段优化车辆进入匝道口的时序；第2 阶段基于第1 阶段的最优时序，优化车辆轨迹. 根据所构建的模型设计了一种启发式算法优化车辆通过匝道冲突区域的时序，然后结合 GPOPS工具优化车辆的轨迹.为了验证所提出方法的有效性，将所提出的方法应用到20 min 随机到达的车流，进行仿真实验.实验结果表明，与先进先出的方法相比，本文所提出的方法能够使总延误减少59.7%，总油耗减少10.5%，说明该方法能够实现车辆以较高的速度通过匝道冲突区域，有效地减少了车辆汇入延误，同时也节约了油耗.     

基于改进极限学习机的公交站点 短时客流预测方法

以公交车IC 卡和GPS数据为基础，提出了一种基于改进粒子群算法优化极限学习机(IPSO-ELM)的公交站点短时客流预测模型.依托IC 卡和GPS 数据在站点的特征表现和内在联系，定义了站点间距，并分析了站间距和车辆到总站距离间的联系；提出了公交乘客上车站点确定方法，进而得到公交站点上车客流量；通过分析公交客流数据特征，确定ELM输入参数维度，并采用IPSO 算法找到ELM的最优隐含层节点参数；最后依托广州市19 路公交车客流数据仓库进行了方法验证.结果表明：所用优化后的ELM方法预测误差在10%以内，并与应用广泛的SVM、ARIMA和传统ELM模型进行对比分析，发现改进的ELM方法拥有更高的可靠性和泛化性能.